Conjunctive normal form - PDFSEARCH.IO - Document Search Engine

Conjunctive normal form
Results: 92

#	Item
31	Overview Modelling Algorithmic Verification Comp4151 Lecture 9-A Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2006-06-05 00:33:08 Mathematical logic Constraint programming Boolean algebra Resolution Conjunctive normal form Unit propagation Davis–Putnam algorithm Ansgar Boolean satisfiability problem Automated theorem proving Theoretical computer science Mathematics
32	Efficient CNF Simplification based on Binary Implication Graphs⋆ Marijn Heule1 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-06-03 17:52:43 Propositional calculus Automated theorem proving Mathematical logic Logic in computer science NP-complete problems Conjunctive normal form Boolean satisfiability problem Resolution Unit propagation Theoretical computer science Logic Mathematics
33	Mechanical Verification of SAT Refutations with Extended Resolution Nathan Wetzler, Marijn J. H. Heule, and Warren A. Hunt Jr. ⋆ The University of Texas at Austin Abstract. We present a mechanically-verified proof che Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2013-07-31 07:11:51 Logic Unit propagation Resolution Conjunctive normal form Clause Literal ACL2 Logic programming First-order logic Theoretical computer science Mathematical logic Automated theorem proving
34	Sage Reference Manual: Symbolic Logic Release 6.6.beta0 The Sage Development Team Add to Reading List Source URL: sagemath.org Language: English - Date: 2015-02-21 07:35:21 Mathematics Boolean algebra Semantics Logical connectives Tautology Sage Truth table Conjunctive normal form Negation Logic Propositional calculus Mathematical logic
35	EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-26 11:40:39 NP-complete problems Logic in computer science Electronic design automation Formal methods Automated theorem proving Boolean satisfiability problem Conjunctive normal form Search algorithm Unit propagation Theoretical computer science Applied mathematics Mathematics
36	MUS Extraction using Clausal Proofs Anton Belov1 , Marijn J. H. Heule2 and Joao Marques-Silva1,3 1 Complex and Adaptive Systems Laboratory, University College Dublin 2 Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 09:41:50 Mathematics Propositional calculus Unsatisfiable core Conjunctive normal form Resolution Logic programming First-order logic Logic Mathematical logic Automated theorem proving
37	Blocked Clause Elimination Matti J¨arvisalo1 , Armin Biere2 , and Marijn Heule 3 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-12-21 10:55:55 NP-complete problems Conjunctive normal form Automated theorem proving Boolean satisfiability problem Resolution Theoretical computer science Mathematics Applied mathematics
38	SOLVING THE SATISFIABILITY PROBLEM USING MESSAGE-PASSING TECHNIQUES S. J. Pumphrey, May[removed]Part III Physics Project Report) A Bayesian message-passing technique, the sum-product algorithm, is described and applied to Add to Reading List Source URL: www.inference.phy.cam.ac.uk Language: English - Date: 2001-06-07 06:04:05 Constraint programming Probability theory Boolean satisfiability problem Electronic design automation Logic in computer science Local search Bayesian inference Algorithm Conjunctive normal form Mathematics Theoretical computer science Applied mathematics
39	Blocked Clause Decomposition Marijn J. H. Heule? and Armin Biere?? The University of Texas at Austin and Johannes Kepler University Linz Abstract. We demonstrate that it is fairly easy to decompose any propositional form Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 14:11:30 Automated theorem proving Propositional calculus Boolean algebra Mathematical logic Logic in computer science Conjunctive normal form Boolean satisfiability problem Resolution Unit propagation Theoretical computer science Mathematics Logic
40	Symmetry in Gardens of Eden Christiaan Hartman Marijn J. H. Heule∗ Delft University of Technology Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 11:31:27 Boolean algebra Symmetry Logic in computer science NP-complete problems Electronic design automation Boolean satisfiability problem True quantified Boolean formula Conjunctive normal form Symmetry in mathematics Theoretical computer science Mathematics Applied mathematics